Implementation of the Quantum Fourier Transform
نویسندگان
چکیده
منابع مشابه
Implementation of the quantum Fourier transform.
A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure...
متن کاملCoherent optical implementations of the fast Fourier transform and their comparison to the optical implementation of the quantum Fourier transform
Optical structures to implement the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms for discretely sampled data sets are considered. In particular, the decomposition of the FFT algorithm into the basic Butterfly operations is described, as this allows the algorithm to be fully implemented by the successive coherent addition and subtraction of two wavefronts (the sub...
متن کاملQuantum Fourier transform of the Prime state
Quantum Computation is a growing and important field in applied physics research, so further theoretical foundations are continuously requested. In this regard, some mathematical algorithms have already been proposed. For instance, creating a quantum state representing the superposition of all prime number less than a value N has been shown to be efficient, and also applying the Quantum Fourier...
متن کاملFourier-transform quantum state tomography
We propose a technique for performing quantum state tomography of photonic polarization-encoded multiqubit states. Our method uses a single rotating wave plate, a polarizing beam splitter, and two photon-counting detectors per photon mode. As the wave plate rotates, the photon counters measure a pseudocontinuous signal which is then Fourier transformed. The density matrix of the state is recons...
متن کاملA quantum Fourier transform algorithm
Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits needed to achieve a desired tolerance, allowing simulation of the algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2001
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.86.1889